CONVERGENCE NEAR SADDLE POINTS 3 0 x Markov Process
نویسنده
چکیده
x+τ (x) for some λ, μ > 0 and τ (x) = O(|x|). Here the processes are indexed so that the variance of the fluctuations of X t is inversely proportional toN . The simplest example arises from the OK Corral gunfight model which was formulated byWilliams and McIlroy (1998) and studied by Kingman (1999). These processes exhibit their most interesting behaviour at times of order logN so it is necessary to establish a fluid limit that is valid for large times. We find that this limit is inherently random and obtain its distribution. Using this, it is possible to derive scaling limits for the points where these processes hit straight lines through the origin, and the minimum distance from the origin that they can attain. The power of N that gives the appropriate scaling is surprising. For example if T is the time that X t first hits one of the lines y = x or y = −x, then
منابع مشابه
Convergence of Markov Processes Near Saddle Fixed Points
We consider sequences (XN t )t≥0 of Markov processes in two dimensions whose fluid limit is a stable solution of an ordinary differential equation of the form ẋt = b(xt), where b(x) = (−μ 0 0 λ ) x+τ(x) for some λ, μ > 0 and τ(x) = O(|x|2). Here the processes are indexed so that the variance of the fluctuations of XN t is inversely proportional to N . The simplest example arises from the OK Cor...
متن کاملSimulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization
In this paper, we present constrained simulated annealing (CSA), a global minimization algorithm that converges to constrained global minima with probability one, for solving nonlinear discrete nonconvex constrained minimization problems. The algorithm is based on the necessary and sufficient condition for constrained local minima in the theory of discrete Lagrange multipliers we developed earl...
متن کاملSubgeometric Rates of Convergence for a Class of Continuous-time Markov Process
Let ( t )t∈R+ be a Harris ergodic continuous-time Markov process on a general state space, with invariant probability measure π . We investigate the rates of convergence of the transition function P t (x, ·) to π ; specifically, we find conditions under which r(t)‖P t (x, ·)−π‖ → 0 as t → ∞, for suitable subgeometric rate functions r(t), where ‖ · ‖ denotes the usual total variation norm for a ...
متن کاملSimulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization ? 1 Problem Deenition
In this paper, we present constrained simulated annealing (CSA), a global minimization algorithm that converges to constrained global minima with probability one, for solving nonlinear discrete non-convex constrained minimization problems. The algorithm is based on the necessary and suucient condition for constrained local minima in the theory of discrete Lagrange multipliers we developed earli...
متن کاملSufficient Condition on the Existence of Saddle Points on Markov Games
We study the sufficient conditions for the existence of a saddle point of timedependent discrete Markov zero-sum game up to a given stopping time. The stopping time is allowed to take either a finite or an infinite non-negative random variable with its associated objective function being well-defined. The result enables us to show the existence of the saddle points of discrete games constructed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005